Quasi-Weak Cost Functions A New Variant of Weakness Achim Blumensath1 Thomas Colcombet2 Denis Kuperberg3 Christof L¨oding4 Pawel Parys3 Michael Vanden Boom5 1 TU

Source URL: www.liafa.univ-paris-diderot.fr

• Formal languages
• Computer science
• Nondeterministic finite automaton
• Finite-state machine
• Regular language
• Ω-automaton
• Automata theory
• Models of computation
• Theoretical computer science

Deciding the weak definability of Büchi definable tree languages∗ Thomas Colcombet1 , Denis Kuperberg2 , Christof Löding3 , and Michael Vanden Boom4 1,2 CNRS and LIAFA, Université Paris Diderot Paris, France

Source URL: www.liafa.univ-paris-diderot.fr

• Ω-automaton
• Büchi automaton
• Tree automaton
• Star height
• Alternating finite automaton
• Muller automaton
• Automata theory
• Theoretical computer science
• Computer science

Comment ompter ave LTL Denis Kuperberg Liafa/CNRS/Université Paris 7, Denis Diderot, Fran e Réunion FREC - 10 mai 2011

Source URL: www.liafa.univ-paris-diderot.fr

Good-for-Games Automata versus Deterministic Automata. Denis Kuperberg1,2 1 University Michal Skrzypczak1

Source URL: www.liafa.univ-paris-diderot.fr

• Science
• Philosophy of science
• Automata theory
• Finite-state machine
• Determinism

On Determinisation of History-Deterministic Automata. Denis Kuperberg Michal Skrzypczak

Source URL: www.liafa.univ-paris-diderot.fr

• Computer science
• Finite-state machine
• Büchi automaton
• Deterministic pushdown automaton
• Automata theory
• Models of computation
• Theoretical computer science

Description of the thesis: Study of classes of regular cost functions. Denis Kuperberg 1 Brief Description The goal of the thesis was to study the recent theory of regular cost functions.

Source URL: www.liafa.univ-paris-diderot.fr

• Semigroup theory
• Theoretical computer science
• Category theory
• Applied mathematics
• Semiautomaton
• Monoid
• Regular language
• Syntactic monoid
• Linear temporal logic
• Formal languages
• Automata theory
• Mathematics

Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , Orna Kupferman1 1 Hebrew University of Jerusalem

Source URL: www.liafa.univ-paris-diderot.fr

• Deterministic automaton
• Finite-state machine
• Ω-automaton
• Automata theory
• Theoretical computer science
• Computer science

SVEC SVEC books on DIDEROT and on the Encyclopédie From Encyclopédie to Encyclopédie méthodique: revision and expansion Kathleen Hardesty Doig SVEC 2013:11, ISBN9, xiv.314 pp., 6 ills. Diderot and Ro

Source URL: www.voltaire.ox.ac.uk

• Early Modern period
• Encyclopédie
• Denis Diderot
• Encyclopédistes
• Voltaire
• Švec
• Age of Enlightenment
• French literature
• Philosophy

Formal Neighbourhoods, Combinatory B¨ohm Trees, and Untyped Normalization by Evaluation Peter Dybjer∗and Denis Kuperberg† February 29, 2008

Source URL: www.liafa.univ-paris-diderot.fr

• Computer science
• Normalisation by evaluation
• Combinatory logic
• Fixed-point combinator
• Simply typed lambda calculus
• Denotational semantics
• Free variables and bound variables
• Functional programming
• Standard ML
• Theoretical computer science
• Lambda calculus
• Mathematics

REVIEW: SIGNS OF LIFE, MELBOURNE INTERNATIONAL BIENNIAL 1999 "An ordered conglomeration of signs (sometimes taken for wonders), galleries function as frames that contextualise, construct and reconstruct particular meanin

Source URL: martinacopley.com

• Gaston Bachelard
• Art
• Denis Diderot
• Representation
• Culture
• French literature
• Aesthetics
• Philosophy
• Epistemologists